Perfect periodic scheduling for three basic cycles
نویسندگان
چکیده
منابع مشابه
Perfect periodic scheduling for three basic cycles
Periodic scheduling has many attractions for wireless telecommunications. It offers energy saving where equipment can be turned off between transmissions, and high-quality reception through the elimination of jitter, caused by irregularity of reception. However, perfect periodic schedules, in which each (of n) client is serviced at regular, prespecified intervals, are notoriously difficult to c...
متن کاملPerfect periodic scheduling for binary tree routing in wireless networks
In this paper we tackle the problem of co-ordinating transmission of data across a Wireless Mesh Network. The single task nature of mesh nodes imposes simultaneous activation of adjacent nodes during transmission. This makes the co-ordinated scheduling of local mesh node traffic with forwarded traffic across the access network to the Internet via the Gateway notoriously difficult. Moreover, wit...
متن کاملCycles and perfect matchings
Fan Chung and Ron Graham (J. Combin. Theory Ser. B 65 (1995), 273-290) introduced the cover polynomial for a directed graph and showed that it was connected with classical rook theory. M. Dworkin (J. Combin. Theory Ser. B 71 (1997), 17-53) showed that the cover polynomial naturally factors for directed graphs associated with Ferrers boards. The authors (Adv. Appl. Math. 27 (2001), 438-481) deve...
متن کاملPerfect periodic correlation sequences
Sequences with the property of perfect periodic autocorrelation are used in various fields such as communication and radar systems. Various methods were introduced to construct such sequences. Most of these methods concentrated on binary or N-phase sequences. In this paper two methods to construct general phase sequences are introduced. The methods are based upon the properties of the Fourier t...
متن کاملA Construction for Perfect Periodic Autocorrelation Sequences
There exists a number of known constructions for perfect sequences over roots of unity. These include Frank sequences of length n over n roots of unity [Heimiller, 1961][Frank, 1962], Chu sequences of length n over n roots of unity for n odd and length n over 2n roots of unity for n even [Chu, 1972], Milewski sequences of length m overm roots of unity [Milewski, 1983], Liu-Fan sequences of leng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2013
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-013-0331-3